On cop-win graphs
نویسندگان
چکیده
Following a question of Anstee and Farber we investigate the possibility that all bridged graphs are cop-win. We show that in7nite chordal graphs, even of diameter two, need not be cop-win and point to some interesting questions, some of which we answer. c © 2002 Elsevier Science B.V. All rights reserved.
منابع مشابه
Almost All Cop-win Graphs Have a Universal Vertex
Cops and Robbers is a vertex-pursuit game played on graphs which has received much recent attention. Graphs where one cop has a winning strategy, so-called cop-win graphs, were discovered in the early 1980’s by Nowakowski and Winkler and independently by Quilliot. Since their introduction, the structure of cop-win graphs has been relatively well-understood. Cop-win graphs possess a vertex elimi...
متن کاملCop and robber games when the robber can hide and ride
In the classical cop and robber game, two players, the cop C and the robber R, move alternatively along edges of a finite graph G = (V,E). The cop captures the robber if both players are on the same vertex at the same moment of time. A graph G is called cop win if the cop always captures the robber after a finite number of steps. Nowakowski, Winkler (1983) and Quilliot (1983) characterized the ...
متن کاملCops and Robbers ordinals of cop-win trees
A relational characterization of cop-win graphs was provided by Nowakowski and Winkler in their seminal paper on the game of Cops and Robbers. As a by-product of that characterization, each cop-win graph is assigned a unique ordinal, which we refer to as a CRordinal. For finite graphs, CR-ordinals correspond to the length of the game assuming optimal play, with the cop beginning the game in a l...
متن کاملCop-Win Graphs and Robber-Win Graphs
Let G be a finite connected graph of order at least two. Two players (a cop and a robber) are allowed to play a game on G according to the following rule: The cop chooses a vertex to stay then the robber chooses a vertex afterwards. After that they move alternately along edges of G, where the robber may opt to stay put when his turn to move comes. The cop wins if he succeeds in putting himself ...
متن کاملAlmost all cop-win graphs contain a universal vertex
We consider cop-win graphs in the binomial random graph G(n, 1/2). We prove that almost all cop-win graphs contain a universal vertex. From this result, we derive that the asymptotic number of labelled cop-win graphs of order n is equal to (1 + o(1))n2 2/2−3n/2+1.
متن کاملAlmost all k-cop-win graphs contain a dominating set of cardinality k
We consider k-cop-win graphs in the binomial random graph G(n, 1/2). It is known that almost all cop-win graphs contain a universal vertex. We generalize this result and prove that for every k ∈ N, almost all k-cop-win graphs contain a dominating set of cardinality k. From this it follows that the asymptotic number of labelled k-cop-win graphs of order n is equal to (1+o(1))(1−2−k)−k ( n k ) 2 ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 258 شماره
صفحات -
تاریخ انتشار 2002